published in Proc . 14 th International Meshing Roundtable , 2005 , 203 - 219 Meshing Volumes Bounded by Smooth Surfaces ∗

نویسندگان

  • Steve Oudot
  • Laurent Rineau
  • Mariette Yvinec
چکیده

This paper introduces a three-dimensional mesh generation algorithm for domains bounded by smooth surfaces. The algorithm combines a Delaunay-based surface mesher with a Ruppert-like volume mesher, to get a greedy algorithm that samples the interior and the boundary of the domain at once. The algorithm constructs provably-good meshes, it gives control on the size of the mesh elements through a user-de ned sizing eld, and it guarantees the accuracy of the approximation of the domain boundary. A noticeable feature is that the domain boundary has to be known only through an oracle that can tell whether a given point lies inside the object and whether a given line segment intersects the boundary. This makes the algorithm generic enough to be applied to a wide variety of objects, ranging from domains de ned by implicit surfaces to domains de ned by level-sets in 3D grey-scaled images or by point-set surfaces.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic swept volume decomposition based on sweep directions extraction for hexahedral meshing

Automatic and high quality hexahedral meshing of complex solid models is still a challenging task. To guarantee the quality of the generated mesh, current commercial software normally requires users to manually decompose a complex solid model into a set of simple geometry like swept volume whose high quality hexahedral mesh can be easily generated. The manual decomposition is a time-consuming p...

متن کامل

Meshing Volumes Bounded by Smooth Surfaces

This paper introduces a three-dimensional mesh generation algorithm for domains bounded by smooth surfaces. The algorithm combines a Delaunaybased surface mesher with a Ruppert-like volume mesher, to get a greedy algorithm that samples the interior and the boundary of the domain at once. The algorithm constructs provably-good meshes, it gives control on the size of the mesh elements through a u...

متن کامل

Volume Decomposition and Feature Recognition for Hexahedral Mesh Generation

Considerable progress has been made on automatic hexahedral mesh generation in recent years. Several automatic meshing algorithms have proven to be very reliable on certain classes of geometry. While it is always worth pursuing general algorithms viable on more general geometry, a combination of the well-established algorithms is ready to take on classes of complicated geometry. By partitioning...

متن کامل

Automatic Curvilinear Quality Mesh Generation Driven by Smooth Boundary and Guaranteed Fidelity

The development of robust high-order finite element methods requires the construction of valid high-order meshes for complex geometries without user intervention. This paper presents a novel approach for automatically generating a high-order mesh with two main features: first, the boundary of the mesh is globally smooth; second, the mesh boundary satisfies a required fidelity tolerance. Invalid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005